Papers with similarity search
BCTH: A Novel Text Hashing Approach via Bayesian Clustering (2020.aacl-main)
Copied to clipboard
| Challenge: | Similarity search is a promising strategy to find the most similar items for a given query item. |
| Approach: | They propose to utilize Bayesian Clustering for Text Hashing to map documents to binary codes by utilizing multiple Bayessian Clusters in parallel. |
| Outcome: | The proposed approach is competitive compared with baselines in the perspective of precision and training speed. |
Improving Evidence Detection by Leveraging Warrants (D19-66)
Copied to clipboard
| Challenge: | Existing methods for extracting warrants from a corpus of arguments are lacking in argument detection. |
| Approach: | They propose to extract multiple warrants from an existing corpus of arguments and then aggregate them . they show that the method needs to be improved, but that it can still improve evidence detection. |
| Outcome: | The proposed method can improve the performance of evidence detection by analyzing arguments and aggregating them. |
Non-Parametric Domain Adaptation for End-to-End Speech Translation (2022.emnlp-main)
Copied to clipboard
| Challenge: | End-to-end speech translation (E2E-ST) systems have received increasing attention due to its less error propagation, lower latency and fewer parameters. |
| Approach: | They propose a non-parametric method that leverages in-domain text translation corpus to achieve domain adaptation for E2E-ST systems. |
| Outcome: | The proposed method outperforms the existing in-domain fine-tuning strategies on the Europarl-ST benchmark. |
Preference-Aware Memory Update for Long-Term LLM Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for integrating long-term memory do not provide dynamic and personalized memory refinement. |
| Approach: | They propose a long-term memory update mechanism that enables dynamic and personalized memory refinement. |
| Outcome: | The proposed mechanism improves the performance of LLM-based agents in five tasks. |
One Sentence One Model for Neural Machine Translation (L18-1)
Copied to clipboard
| Challenge: | Neural machine translation (NMT) is a new state of the art that can produce better results than traditional statistical machine translation. |
| Approach: | They propose a dynamic neural network which learns a general network as usual and fine-tunes it for each test sentence. |
| Outcome: | The proposed method improves translation performance when similar sentences are available. |
Making RALM Robust to Irrelevant Contexts via Layer Knowledge Guided Attention (2025.findings-acl)
Copied to clipboard
Weijie Shi, Hao Chen, Jiaming Li, Yao Zhao, Yazhong Zhang, Qijin Chen, Jipeng Zhang, Ruiyuan Zhang, Jia Zhu, Jiajie Xu, Xiaofang Zhou
| Challenge: | Large language models (LLMs) face factual hallucination and knowledge obsolescence when tackling knowledge-intensive tasks. |
| Approach: | They propose a layer-knowledge guided attention method which harnesses the layer-wise knowledge of large language models to optimize per-layer attention on useful passages. |
| Outcome: | The proposed method outperforms existing methods on RALM benchmarks. |
NASH: Toward End-to-End Neural Architecture for Generative Semantic Hashing (P18-1)
Copied to clipboard
Dinghan Shen, Qinliang Su, Paidamoyo Chapfuwa, Wenlin Wang, Guoyin Wang, Ricardo Henao, Lawrence Carin
| Challenge: | Existing approaches to fast similarity search require two-stage training and the binary constraints are handled ad-hoc. |
| Approach: | They propose an end-to-end neural architecture for semantic hashing where binary hash codes are treated as Bernoulli latent variables. |
| Outcome: | The proposed approach outperforms state-of-the-art models on unsupervised and supervised scenarios on three public datasets. |
Doc2hash: Learning Discrete Latent variables for Documents Retrieval (N19-1)
Copied to clipboard
| Challenge: | Learning to hash via generative model is a powerful paradigm for fast similarity search in documents retrieval. |
| Approach: | They propose a method that trains a generative model to generate hash codes by using continuous relaxation on priors. |
| Outcome: | The proposed method outperforms other state-of-the-art methods in qualitative and quantitative experiments. |
Efficient Nearest Neighbor Emotion Classification with BERT-whitening (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for retrieval-based methods use pre-trained models for similarity search, but they perform poorly in retrieving semantically similar sentences. |
| Approach: | They propose a non-parametric emotion classification method using nearest neighbor retrieval that can be added to any pre-trained model without further training. |
| Outcome: | The proposed method improves the pre-trained model by 1.17 F1-macro on two emotion classification datasets. |
TopXGen: Topic-Diverse Parallel Data Generation for Low-Resource Machine Translation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | In-context learning and similarity search have been shown to improve LLMs' performance in machine translation, but they lag behind when dealing with low-resource languages. |
| Approach: | They propose a method that uses an LLM to generate topic-specific target-side data in the LRL. |
| Outcome: | The proposed approach boosts LLM translation performance during in-context learning and fine-tuning. |